A comparison of interval linear programming with the simplex method
نویسندگان
چکیده
منابع مشابه
A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملFirst step immersion in interval linear programming with linear dependencies
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. We present a class of problems that are easily solved by reduction to the classi...
متن کاملThe (Dantzig) simplex method for linear programming
G eorge Dantzig, in describing the " Origins of the Simplex Method, " 1 noted that it was the availability of early digital computers that supported and invited the development of LP models to solve real-world problems. He agreed that invention is sometimes the mother of necessity. Moreover, he commented that he initially rejected the simplex method because it seemed intuitively more attractive...
متن کاملProviding a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach
Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1981
ISSN: 0024-3795
DOI: 10.1016/0024-3795(81)90016-1